منابع مشابه
Sublinear-time Algorithms
In this paper we survey recent advances in the area of sublinear-time algorithms.
متن کاملSublinear Time Algorithms
Sublinear time algorithms represent a new paradigm in computing, where an algorithm must give some sort of an answer after inspecting only a very small portion of the input. We discuss the types of answers that one can hope to achieve in this setting.
متن کاملSeminar on Sublinear Time Algorithms
Proof Idea For any two specific inputs there exists an algorithm that is adapted to these inputs. For example, if we take the two inputs x = (1, 2, ..., n) as a “yes” example, and y = (1, 1, 2, 2, ..., n, n, n + 1, n + 2, ..., n(1 − )) as a “no” example, then an algorithm that checks the second coordinate can distinguish between them. Therefore, we look on distributions over inputs. We need two...
متن کاملCombinatorial Sublinear-Time Fourier Algorithms
We study the problem of estimating the best k term Fourier representation for a given frequency-sparse signal (i.e., vector) A of length N k. More explicitly, we investigate how to deterministically identify k of the largest magnitude frequencies of Â, and estimate their coefficients, in polynomial(k, log N) time. Randomized sublinear time algorithms which have a small (controllable) probabilit...
متن کاملSublinear Time and Space Algorithms 2016B – Lecture 7 Sublinear-Time Algorithms for Sparse Graphs∗
Problem definition: Input: A graph represented (say) as the adjacency list for each vertex (or even just the degree of each vertex) Goal: Compute the average degree (equiv. number of edges) Concern: Seems to be impossible e.g. if all degrees ≤ 1, except possibly for a few vertices whose degree is about n. Theorem 1 [Feige, 2004]: There is an algorithm that estimates the average degree d of a co...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: SIAM Journal on Discrete Mathematics
سال: 2011
ISSN: 0895-4801,1095-7146
DOI: 10.1137/100791075